368. Largest Divisible Subset - LeetCode Solution

class Solution:
    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
        
        a = {-1: set()}
        for x in sorted(nums):
            a[x] = max((a[d] for d in a if x % d == 0), key=len) | {x}
        return list(max(a.values(), key=len))